Conditional Partial Order Graphs and Dynamically Recon gurable Control Synthesis

نویسندگان

  • A. Mokhov
  • A. Yakovlev
چکیده

The paper introduces a new formal model for specifying control paths in the context of asynchronous system design. The model, called Conditional Partial Order Graph (CPOG), is capable of capturing concurrency and choice in a system's behaviour in a compact and e cient way. A problem of CPOG synthesis is formulated and solved; various CPOG optimisation techniques are presented. The introduced model can be used for the speci cation of system behaviour and for synthesis of area-e cient dynamically recon gurable controllers. The synthesis of a controller is based on a novel generic architecture, called Transition Sequence Encoder (TSE). The synthesized controllers are speed independent and thus very robust to parametric variations. The ideas presented in the paper can be applied for CPU control synthesis as well as for synthesis of di erent kinds of event-coordination circuits often used in data coding and communication in digital systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Erlangen Slot Machine - An FPGA-Based Partially Reconfigurable Computer

Partial recon guration is a special case of device con guration that allows to change only parts of a hardware circuit at run-time. Only a prede ned region of an FPGA is updated while the remainder of the device continues to operate undisturbed. This is especially valuable when a device operates in a missioncritical environment and cannot be disrupted while a subsystem is rede ned for performan...

متن کامل

Module Allocation for Dynamically Reconfigurable Systems

The synthesis of dynamically recon gurable systems poses some new challenges for high-level synthesis tools. In this paper, we deal with the task of module allocation as this step has a direct in uence on the performance of the dynamically recon gurable design. We propose a con guration bundling driven module allocation technique that can be used for component clustering. The basic idea is to g...

متن کامل

Synthesizing Recon gurable Sequential Machines Using Tabular Models

Two common problems we face in implementing recon gurable systems on currently available FPGA chips are: (1) tting designs which are too big for available hardware resources on a single FPGA chip, (2) lack of synthesis tools for high-level speci cations. One solution to address the rst problem is partial recon guration or run-time recon guration which requires only loading a portion of the desi...

متن کامل

Circuit Partitioning for Dynamically Recon gurable FPGAs

Dynamically recon gurable FPGAs have the potential to dramatically improve logic density by time-sharing a physical FPGA device. This paper presents a networkow based partitioning algorithm for dynamically recon gurable FPGAs based on the architecture in [2]. Experiments show that our approach outperforms the enhanced force-directed scheduling method in [2] in terms of communication cost.

متن کامل

Object oriented development method for recon®gurable embedded systems

The authors present a novel method for developing recon®gurable systems targeted at embedded system applications. The paper shows how an existing object oriented design method (MOOSE) has been adapted to include recon®gurable hardware (FPGAs). Previous research on recon®gurable computing has concentrated on the ef®cient mapping of algorithms to FPGAs. It must be realised that recon®gurable hard...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007